Confidence Estimation for Graph-based Semi-supervised Learning

نویسندگان

  • Tao Guo
  • Guiyang Li
چکیده

To select unlabeled example effectively and reduce classification error, confidence estimation for graphbased semi-supervised learning (CEGSL) is proposed. This algorithm combines graph-based semi-supervised learning with collaboration-training. It makes use of structure information of sample to calculate the classification probability of unlabeled example explicitly. With multi-classifiers, the algorithm computes the confidence of unlabeled example implicitly. With dualconfidence estimation, the unlabeled example is selected to update classifiers. The comparative experiments on UCI datasets indicate that CEGSL can effectively exploit unlabeled data to enhance the learning performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Label Propagation for Semi-Supervised Learning in Self-Organizing Maps

Semi-supervised learning aims at discovering spatial structures in high-dimensional input spaces when insufficient background information about clusters is available. A particulary interesting approach is based on propagation of class labels through proximity graphs. The Emergent Self-Organizing Map (ESOM) itself can be seen as such a proximity graph that is suitable for label propagation. It t...

متن کامل

Estimation of tangent planes for neighborhood graph correction

Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neighborhood graph. In the presence of shortcuts (union of two points whose distance measure along the submanifold is actually large), the resulting embbeding will be unsatisfactory. This paper proposes an algorithm to co...

متن کامل

Typed Graph Models for Semi-Supervised Learning of Name Ethnicity

This paper presents an original approach to semi-supervised learning of personal name ethnicity from typed graphs of morphophonemic features and first/last-name co-occurrence statistics. We frame this as a general solution to an inference problem over typed graphs where the edges represent labeled relations between features that are parameterized by the edge types. We propose a framework for pa...

متن کامل

Towards generalization of semi-supervised place classification over generalized Voronoi graph

With the progress of human-robot interaction (HRI), the ability of a robot to perform highlevel tasks in complex environments is fast becoming an essential requirement. To this end, it is desirable for a robot to understand the environment at both geometric and semantic levels. Therefore in recent years, research towards place classification has been gaining in popularity. After the era of heur...

متن کامل

Nonparametric Transforms of Graph Kernels for Semi-Supervised Learning

We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of graph Laplacians, and combine labeled and unlabeled data in a systematic fashion. Unlike previous work using diffusion kernels and Gaussian random field kernels, a nonparametric kernel approach is presented that incorporat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012